A Shrinking Projection Algorithm with Errors for Costerro Bounded Linear Mappings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces

The shrinking projection method has gained more and more attention as a powerful tool for the approximation of a fixed point of nonlinear mappings. In this paper, we introduce a new shrinking projection method for the approximation of fixed points of a family of pseudocontractive mappings in a Hilbert space. Using this method, we also deal with the problem of finding a common zero of a family o...

متن کامل

A polynomial projection algorithm for linear programming

We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear equations and non-negativity constraints. Then it uses a procedure that either finds a solution for the respective homogeneous system or provides the information based on which the algorithm rescales the homogeneous system so that its fea...

متن کامل

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

Sliding Window Generalized Kernel Affine Projection Algorithm Using Projection Mappings

Very recently, a solution to the kernel-based online classification problem has been given by the adaptive projected subgradient method (APSM). The developed algorithm can be considered as a generalization of a kernel affine projection algorithm (APA) and the kernel normalized least mean squares (NLMS). Furthermore, sparsification of the resulting kernel series expansion was achieved by imposin...

متن کامل

Averaged Mappings and the Gradient-Projection Algorithm

It is well known that the gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this article, we first provide an alternative averaged mapping approach to the GPA. This approach is operator-oriented in nature. Since, in general, in infinite-dimensional Hilbert spaces, GPA has only weak convergence, we provide two modifications of GPA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematics

سال: 2020

ISSN: 2314-4629,2314-4785

DOI: 10.1155/2020/7052349